package com.example.leetdemo.finash;

import java.util.PriorityQueue;

public class Solution3264 {

    public int[] getFinalState(int[] nums, int k, int multiplier) {
        for (int i = 0; i < k; i++) {
            int min = nums[0], index = 0;
            for (int j = 1; j < nums.length; j++) {
                if (nums[j] < min) {
                    min = nums[j];
                    index = j;
                }
            }
            nums[index] = min * multiplier;
        }
        return nums;
    }

    public static void main(String[] args) {
        PriorityQueue queue = new PriorityQueue();
    }

}
